package Q3;

import java.util.Scanner;

public class Main {

    public static String str;
    public static int len;
    public static boolean flag;

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        str = scanner.next();
        len = str.length();

        dfs(0, new boolean[len]);
        if (flag) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }

    public static void dfs(int index, boolean[] isRed) {

        if (flag) {
            return;
        }

        if (index == len) {
            long notRedSum = 0;
            long redSum = 0;
            for (int i = 0; i < len; i++) {
                if (isRed[i]) {
                    redSum += (str.charAt(i) - '0');
                } else {
                    notRedSum += (str.charAt(i) - '0');
                }
            }

            if (notRedSum == redSum) {
                flag = true;
            }

            return;
        }

        for (int i = index; i < len; i++) {
            //染红
            isRed[i] = true;
            dfs(i + 1, isRed);
            //回溯
            isRed[i] = false;

            //不染红
            dfs(i + 1, isRed);
        }
    }
}
